Informatics Publishing Limited

P. N. Kapoor ¹, R. K. Chauhan ¹

Affiliations
1 Geology Division, KDMIPE, ONGC, Dehra Dun - 248 195, IN

Abstract

The Core samples from the sea bottom sediments offshore Karwar are studied for palaeoecological interpretation and organic matter preservation. The samples are rich in different types of phytoplankton the diatoms are studied to interpret palaeoecology. The study suggests warm water tropical environment during deposition of sediments and age of the sediments is less than 0 65 million years.

Keywords

Diatoms, Ecology, Kerala-Konkan Basin.

Full Text

     

Surender Kumar ¹, R. K. Chauhan ², Parveen Kumar ³

Affiliations
1 Department of Information Technology, Haryana College of Technology and Management(HCTM), Ambala Road Kaithal-136027 Haryana, IN
2 Department of Computer Science & Application, Kurukshetra University, Kurukshetra (Haryana), IN
3 Department of Computer Science & Engineering, Meerut Institute of Engineering & Technology(MIET), Meerut (U.P), IN

Abstract

Checkpointing is an efficient fault tolerance technique used in distributed systems. Due to the emerging challenges of the mobile distributed system as low bandwidth, mobility, lack of stable storage, frequent disconnections and limited battery life, the fault tolerance technique designed for distributed system can not directly implemented on mobile distributed systems. Hence, the checkpointing algorithms having lesser number of coordinated messages and fewer checkpoints nearly to minimum are preferred for mobile environment. But both number of coordinated message and number of checkpoints are orthogonal. As time based approach uses lesser number of coordinated message but have higher number of checkpoints than minimum number of checkpoints required. On the other hand coordinated checkpointing approach takes lesser checkpoints than time based nearly to minimum but have higher coordinated message. Our proposed coordinated checkpointing approach use time to indirectly coordinate to minimizing the number of coordinated message transmitted through the wireless link and reduces the number of checkpoints nearest to the minimum. The algorithm is non-blocking and forces only minimum number dependent process to takes their checkpoints.

Keywords

Fault Tolerance, Distributed Systems, Mobile Systems, Checkpointing, Consistent Global State, and Coordinated Checkpointing.

Full Text

     

Surender Kumar ¹, R. K. Chauhan ², Parveen Kumar ³

Affiliations
1 Department of Information Technology, Haryana College of Technology & Management, Kaithal, Haryana, IN
2 Department of Computer Science and Application, Kurukshetra University, Kurukshetra, IN
3 Department Computer Science and Engineering, MIET, Meerut (U.P), IN

Abstract

Mobile distributed system is a distributed system with mobile node as well as static node. Due to unique characteristic of mobile nodes likes mobility, limited bandwidth on wireless link, limited battery power backup, limited local storage, frequent disconnection and the handoff, traditional fault tolerance scheme can not be directly applied in mobile distributed systems. Non blocking coordinated checkpointing algorithm which forces minimum number of process to take their checkpoint, are preferred approach for mobile distributed systems. To achieve the goal of non-blocking and minimum- process sometimes, it also requires piggybacking of some extra information onto normal messages or taking some useless checkpoints. As during checkpointing lot of checkpointing information including all variables, the environment, control information register value are transmitted through the wireless links. So these forced/useless checkpoints increase the checkpointing overheads as these are transmitted through the wireless link and require large communication bandwidth and energy. Therefore our efforts are mostly directed towards avoiding the useless checkpoints. In this paper we propose a minimum process non-blocking coordinated checkpointing algorithm which does not take any useless checkpoint and produce consistent global state with minimum number of checkpoints. This approach can significantly save battery energy as well as wireless communication bandwidths.

Keywords

Distributed Systems, Mobile Distributed Systems, Domino Effect, Checkpointing, Coordinated, Uncoordinated.

Full Text

     

Ramesh Kait ¹, R. K. Chauhan ¹

Affiliations
1 Department of Computer Science & Applications, Kurukshetra University, Kurukshetra, IN

Abstract

The fundamental component for the success of VANET (Vehicular Ad hoc NETworks) applications is routing since it must efficiently handle rapid topology changes and a fragmented network. On demand set up, fault tolerance and unconstrained connectivity are a couple of advantages that why mobile computing continues to enjoy rapid growth.However, it can be expected that security attacks are likely to increase in the coming future due to the more and more wirelss applications being developed and deployed on to the well-known expose nature of wireless medium. Thanks to the substantial research efforts carried out by the community so far, we make the following contribution in this paper. In this paper we are specifically taking real life application of mobile ad-hoc networks i.e. VANET (vehicular adhoc networks). We will present a novel infrastructure for vehicle communication on highway and propose some potential security challenges from a driver's perspective and car manufacturer's .We will introduce an exemplary approach to outline various challenges and some possible solution.

Keywords

Vehicular Ad hoc NETworks (VANET), Security, MANETs, VC, V2V.

Full Text

   

Manoj Singhal ¹, Girish Sharma ², R. K. Chauhan ³

Affiliations
1 Department of Information Technology, Accurate Institute of Management and Technology, Greater Noida (U.P.), IN
2 Department of Computer Applications, Bhai Parmanand Institute of Business Studies, New Delhi, IN
3 Departement of Computer Science and Applications, Kurukshetra University, Kurukshetra, IN

Abstract

We know that binary decision diagram is a data structure that is used to store a Boolean function. They are used to find out the terminal reliability of a computer communication network. To generate the binary decision diagram of a given computer communication network, we need to order the edges of the given computer communication network because the size of the binary decision diagram is dependent on the ordering of the variables (edges). There are three types of variable ordering; optimal, good and bad ordering. Optimal ordering are those ordering which generate minimum size binary decision diagram. In this paper we have shown that if a directed computer communication network has m disjoints min-paths then m! optimal variable orderings exist to generate the binary decision diagrams of the given computer communication network.

Keywords

Binary Decision Diagrams (BDD), Computer communication Network (CNN), Directed Acyclic Graph (DAG), Modified Binary Decision Diagrams (MBDD).

Full Text

   

Anupam Bhatia ¹, R. K. Chauhan ²

Affiliations
1 Kurukshetra University P.G. Regional Centre, Jind, IN
2 Department of Computer Science and Applications, Kurukshetra University, Kurukshetra, IN

Abstract

In this paper we have presented the detailed model of Knowledge Penetration Process. Knowledge Penetration Process (KPP) is improved and modified KDD. The major modification in KPP over KDD is the usage of intermediate results, auxiliary data, auxiliary statistics and auxiliary tuples.

Keywords

Knowledge Penetration Process, Knowledge Discovery in Databases, Preprocessing, Pre Mining, Mining, Descriptive Data Mining, Predictive Data Mining.

Full Text

   

Manoj Singhal ¹, R. K. Chauhan ², Girish Sharma ³

Affiliations
1 Dept. Of MCA, Academy of Business and Engineering Sciences, Ghaziabad (U.P.), IN
2 Deptt. of Computer Science and Applications, Kurukshetra University, Kurukshetra, IN
3 Deptt. of MCA, Bhai Parmanand Institute of Business Studies, Delhi, IN

Abstract

In this paper we adopted a new approach for evaluating the size of the BDD and also generated modified binary decision diagrams for calculating the reliability of the given directed computer communication network. We have also shown that these modified binary decision diagrams are of minimum size. Conclusively, we can say that more than one optimal variable ordering may exist for finding the reliability of particular networks.

Keywords

Binary Decision Diagrams (BDD), Directed Acyclic Graph (DAG), Computer Communication Network (CNN), Ordered Binary Decision Diagrams (OBDD).

Full Text